Efficiency analysis of load balancing games with and without activation costs

In this paper, we study two models of resource allocation games: the classical load-balancing game and its new variant involving resource activation costs. The resources we consider are identical and the social costs of the games are utilitarian, which are the average of all individual players' costs. Using the social costs we assess the quality of pure Nash equilibria in terms of the price of anarchy (PoA) and the price of stability (PoS). For each game problem, we identify suitable problem parameters and provide a parametric bound on the PoA and the PoS. In the case of the load-balancing game, the parametric bounds we provide are sharp and asymptotically tight

Resource allocation games of various social objectives

In this paper, we study resource allocation games of two different cost components for individual game players and various social costs. The total cost of each individual player consists of the congestion cost, which is the same for all players sharing the same resource, and resource activation cost, which is proportional to the individual usage of the resource. The social costs we consider are, respectively, the total of costs of all players and the maximum congestion cost plus total resource activation cost. Using the social costs we assess the quality of Nash equilibria in terms of the price of anarchy (PoA) and the price of stability (PoS). For each problem, we identify one or two problem parameters and provide parametric bounds on the PoA and PoS. We show that they are unbounded in general if the parameter involved are not restricted

Time/cost trade-offs in machine scheduling with controllable processing times

Ankara : The Department of Industrial Engineering and the Institute of Engineering and Science of Bilkent University, 2008.Thesis (Ph.D.) -- Bilkent University, 2008.Includes bibliographical references leaves 166-175Processing time controllability is a critical aspect in scheduling decisions since most of the scheduling practice in industry allows controlling processing times. A very well known example is the computer numerically controlled (CNC) machines in flexible manufacturing systems. Selected processing times for a given set of jobs determine the manufacturing cost of the jobs and strongly affect their scheduling performance. Hence, when making processing time and scheduling decisions at the same time, one must consider both the manufacturing cost and the scheduling performance objectives. In this thesis, we have studied such bicriteria scheduling problems in various scheduling environments including single, parallel and non-identical parallel machine environments. We have included some regular scheduling performance measures such as total weighted completion time and makespan. We have considered the convex manufacturing cost function of CNC turning operation. We have provided alternative methods to find efficient solutions in each problem. We have particularly focused on the single objective problems to get efficient solutions, called the -constraint approach. We have provided efficient formulations for the problems and shown useful properties which led us to develop fast heuristics to generate set of efficient solutions. In this thesis, taking another point of view, we have also studied a conic quadratic reformulation of a machine-job assignment problem with controllable processing times. We have considered a convex compression cost function for each job and solved a profit maximization problem. The convexity of cost functions is a major source of difficulty in finding optimal integer solutions in this problem, but our strengthened conic reformulation has eliminated this difficulty. Our reformulation approach is sufficiently general so that it can also be applied to other mixed 0-1 optimization problems with separable convex cost functions.Our computational results demonstrate that the proposed conic reformulation is very effective for solving the machine-job assignment problem with controllable processing times to optimality. Finally, in this thesis, we have considered rescheduling with controllable processing times. In particular, we show that in contrast to fixed processing times, if we have the flexibility to control the processing times of the jobs, we can generate alternative reactive schedules in response to a disruption such as machine breakdown. We consider a non-identical parallel machining environment where processing times of the jobs are compressible at a certain cost which is a convex function of the compression on the processing time. When rescheduling, it is critical to catch up the initial schedule as soon as possible by reassigning the jobs to the machines and changing their processing times. On the other hand, one must keep the total cost of the jobs at minimum. We present alternative match-up scheduling problems dealing with this trade-off. We use the strong conic reformulation approach in solving these problems. We further provide fast heuristic algorithms.Gürel, SinanPh.D

The congested multicommodity network design problem

This paper studies a version of the fixed-charge multicommodity network design problem where in addition to the traditional costs of flow and design, congestion at nodes is explicitly considered. The problem is initially modeled as a nonlinear integer programming formulation and two solution approaches are proposed: (i) a reformulation of the problem as a mixed integer second order cone program to optimally solve the problem for small to medium scale problem instances, and (ii) an evolutionary algorithm using elements of iterated local search and scatter search to provide upper bounds. Extensive computational results on new benchmark problem instances and on real case data are presented

Recent Advances in Health Biotechnology During Pandemic

The outbreak of severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2), which emerged in 2019, cut the epoch that will make profound fluctuates in the history of the world in social, economic, and scientific fields. Urgent needs in public health have brought with them innovative approaches, including diagnosis, prevention, and treatment. To exceed the coronavirus disease 2019 (COVID-19) pandemic, various scientific authorities in the world have procreated advances in real time polymerase chain reaction (RT-PCR) based diagnostic tests, rapid diagnostic kits, the development of vaccines for immunization, and the purposing pharmaceuticals for treatment. Diagnosis, treatment, and immunization approaches put for- ward by scientific communities are cross-fed from the accrued knowledge of multidisciplinary sciences in health biotechnology. So much so that the pandemic, urgently prioritized in the world, is not only viral infections but also has been the pulsion in the development of novel approaches in many fields such as diagnosis, treatment, translational medicine, virology, mi- crobiology, immunology, functional nano- and bio-materials, bioinformatics, molecular biol- ogy, genetics, tissue engineering, biomedical devices, and artificial intelligence technologies. In this review, the effects of the COVID-19 pandemic on the development of various scientific areas of health biotechnology are discussed

Tek makinada koruyucu bakım çizelgeleme :|bimalat koşulları temelli yaklaşım

Cataloged from PDF version of article.Thesis (M.S.): Bilkent University, Department of Industrial Engineering, İhsan Doğramacı Bilkent University, 2002.Includes bibliographical references (leaves 104-108).by Sinan Gürel.M.S

A conic quadratic formulation for a class of convex congestion functions in network flow problems

In this paper we consider a multicommodity network flow problem with flow routing and discrete capacity expansion decisions. The problem involves trading off congestion and capacity assignment (or expansion) costs. In particular, we consider congestion costs involving convex, increasing power functions of flows on the arcs. We first observe that under certain conditions the congestion cost can be formulated as a convex function of the capacity level and the flow. Then, we show that the problem can be efficiently formulated by using conic quadratic inequalities. As most of the research on this problem is devoted to heuristic approaches, this study differs in showing that the problem can be solved to optimum by branch-and-bound solvers implementing the second-order cone programming (SOCP) algorithms. Computational experiments on the test problems from the literature show that the continuous relaxation of the formulation gives a tight lower bound and leads to optimal or near optimal integer solutions within reasonable CPU times

Havayolu Taşımacılığında Çizelge Aksaklıkları Yönetimi

Projenin konusu havayolu taşımacılığında çizelge aksaklıkları durumunda yeniden çizelgeleme problemlerini kontrol edilebilir uçuş sürelerini gözönüne alarak modellemek ve çözmektir. Problemde baştan verilmiş bir ilk çizelge üzerinde aksama olarak belli uçuşların herhangi bir nedenle gecikmesi ya da iptali ele alınacaktır. Verilen ilk çizelge ve bir aksama için yeni bir çizelge oluşturulmaya çalışılacaktır. Havayolu yolcu taşımacılığı sektöründe çizelgeleme problemleri karar destek sistemleri kullanılarak çözülse de halen aksaklık yönetiminde ortaya çıkan problemler için karar destek sistemleri oluşturulmamıştır. Projenin amacı aksaklık yönetimi konusunda uygulanabilir çözümler üretmektir. Ele alınan yeniden çizelgeleme probleminin pilotlar tarafından değil havayolu şirketinin operasyon merkezi tarafından çözülmesi gerekmektedir. Projede yöntem olarak öncelikle ele alınan problemin matematiksel modellenmesi ve ticari çözücülerle çözülmesi planlanmaktadır. Elde edilecek matematiksel modelde ortaya çıkacak doğrusal olmayan terimler konik karesel eşitsizliklerle modellenecektir. Problemin çözümünde ABD'nin BTS kurumunca yayınlanan uçak çizelgeleri kullanılacaktır. Elde edilecek çözümler analiz edilerek kontrol edilebilir uçuş sürelerinin havayolu yeniden çizelgeleme problemlerinde yaratacağı maliyet düşüşleri ortaya konacaktır. Bunun dışında ticari çözücülerin uygulamada ortaya çıkan gerçek boyuttaki problemlerin çözümünde yetersiz kalması durumunda problemin çözümü için sezgisel tarama algoritmaları geliştirilecek ve bu algoritmaların performansları sınanacaktır

A conic quadratic formulation for a class of convex congestion functions in network flow problems

In this paper we consider a multicommodity network flow problem with flow routing and discrete capacity expansion decisions. The problem involves trading off congestion and capacity assignment (or expansion) costs. In particular, we consider congestion costs involving convex, increasing power functions of flows on the arcs. We first observe that under certain conditions the congestion cost can be formulated as a convex function of the capacity level and the flow. Then, we show that the problem can be efficiently formulated by using conic quadratic inequalities. As most of the research on this problem is devoted to heuristic approaches, this study differs in showing that the problem can be solved to optimum by branch-and-bound solvers implementing the second-order cone programming (SOCP) algorithms. Computational experiments on the test problems from the literature show that the continuous relaxation of the formulation gives a tight lower bound and leads to optimal or near optimal integer solutions within reasonable CPU times.Integer programming Network flows Second-order cone programming Capacity expansion Congestion costs Convex increasing power functions